Conditional independence in propositional logic

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditional independence in propositional logic

Independence—the study of what is relevant to a given problem of reasoning—is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and some more restricted forms of it. Many characterizations and properties of these independence relations are provided. We show them related to many ...

متن کامل

Propositional Independence Conditional independence

Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...

متن کامل

Propositional Reasoning about Saturated Conditional Probabilistic Independence

Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted sub...

متن کامل

Complexity of Propositional Independence and Inclusion Logic

We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence and inclusion logic and their extensions by the classical negation.

متن کامل

Probabilistic Logic with Conditional Independence Formulae

We investigate a probabilistic propositional logic that is an extension of the logic proposed by Fagin et al. [4] with conditional independence formulae. We give an axiomatization which we show to be complete for the kind of inferences allowed by Bayesian networks.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2002

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(02)00244-8